The Optimal Sequence of Costly Mechanisms

نویسنده

  • Hanzhe Zhang
چکیده

An impatient, risk-neutral monopolist must sell one unit of an indivisible good within a fixed number of periods while one-period-lived buyers with independent private values arrive over time. In each period, the seller can either run a reserve price auction while incurring a cost or post a price without the cost. We characterize the optimal sequence of mechanisms that maximizes the seller’s expected profits. When there is an infinite number of periods, repeatedly running auctions with the same reserve price or posting a constant price is optimal. When there is a finite number of periods, the optimal sequence is a sequence of declining prices, a sequence of auctions with declining reserve prices converging to the static optimal monopoly reserve price, or a sequence of prices followed by a sequence of auctions. Most interestingly, a sequence of auctions before a sequence of posted prices is never optimal. The mechanism sequence of posted prices followed by auctions remains the general optimal sequence under various extensions of the basic setting and resembles a Buy-It-Now option.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto Optimal Balancing of Four-bar Mechanisms Using Multi-Objective Differential Evolution Algorithm

Four-bar mechanisms are widely used in the industry especially in rotary engines. These mechanisms are usually applied for attaining a special motion duty like path generation; their high speeds in the industry cause an unbalancing problem. Hence, dynamic balancing is essential for their greater efficiency. In this research study, a multi-objective differential evolution algorithm is used for P...

متن کامل

A two-stage stochastic rule-based model to determine pre-assembly buffer content

This study considers instant decision-making needs of the automobile manufactures for resequencing vehicles before final assembly (FA). We propose a rule-based two-stage stochastic model to determine the number of spare vehicles that should be kept in the pre-assembly buffer to restore the altered sequence due to paint defects and upstream department constraints. First stage of the model decide...

متن کامل

Optimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

متن کامل

Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...

متن کامل

Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning

This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014